COORDINATING AGGREGATE AND DETAILED SEHEDULING DECISIONS IN THE ONE-MACHINE JOB SHOP. I. THEORY.GELDERS L; KLEINDORFER PR.1974; OPER. RES.; U.S.A.; DA. 1974; VOL. 22; NO 1; PP. 46-60; BIBL. 18 REF.Article

CONSTITUTION D'HORAIRES OPTIMAUX POUR LES PROCESSEURS FONCTIONNANT EN PARALLELELINSKIJ VS; KORNEV MD.1972; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; S.S.S..R.; DA. 1972; NO 3; PP. 160-167; BIBL. 14 REF.Serial Issue

EIN BEITRAG ZU DEN REIHENFOLGEPROBLEMEN. = CONTRIBUTION A LA SOLUTION DES PROBLEMES D'ORDONNANCEMENT DES TACHESMANDEL R.1975; EKON.-MAT. OBZ.; CESKOSL.; DA. 1975; VOL. 11; NO 1; PP. 22-27; ABS. ANGL. TCHEQUE; BIBL. 4 REF.Article

LES PROCEDURES D'EXPLORATION ET D'OPTIMISATION PAR SEPARATION ET EVALUATION.HANSEN P.1975; IN: COMB. PROGRAMM. METHODS APPL. PROC. NATO ADV. STUDY INST.; VERSAILLES; 1974; DORDRECHT; D. REIDEL; DA. 1975; PP. 29-65; BIBL. DISSEM.Conference Paper

PROBLEMES COMBINATOIRES EXTREMAUX DE SYNTHESE DES RESEAUX DE COMMUTATIONPERSHIN O YU.1975; IN: UPR. MNOGOSVYAZNYMI SIST.; MOSKVA; NAUKA; DA. 1975; PP. 79-82; BIBL. 2 REF.Book Chapter

MINIMIZING MEAN FLOWTIME IN THE FLOW SHOP WITH NO INTERMEDIATE QUEUES.VAN DEMAN JM; BAKER KR.1974; A.I.I.E. TRANS.; U.S.A.; DA. 1974; VOL. 6; NO 1; PP. 28-34; BIBL. 5 REF.Article

BRANCH-AND-BOUND SEARCH FOR EXPERIMENTAL DESIGNS BASED ON D OPTIMALITY AND OTHER CRITERIAWELCH WJ.1982; TECHNOMETRICS; ISSN 0040-1706; USA; DA. 1982; VOL. 24; NO 1; PP. 41-48; BIBL. 17 REF.Article

A MULTI-COMMODITY FLOW NETWORK DESIGN PROBLEMFOULDS LR.1981; TRANSP. RES., PART B: METHODOL.; ISSN 0191-2615; GBR; DA. 1981; VOL. 15; NO 4; PP. 273-283; BIBL. 20 REF.Article

EIN BEZUEGLICH KERNSPEICHER- UND RECHENZEITBEDARF EFFIZIENTES BRANCH-UND-BOUND-VERFAHREN ZUR LOESUNG DES TRAVELLING-SALESMAN-PROBLEMS. = UN ALGORITHME BRANCH AND BOUND POUR RESOUDRE DES PROBLEMES DU COMMIS VOYAGEUR AVEC DES BESOINS EFFICACES DE STOCKAGE ET DE TEMPS D'ORDINATEURSCHONLEIN A.1976; ANGEW. INFORMAT.; DTSCH.; DA. 1976; VOL. 18; NO 3; PP. 100-108; ABS. ANGL.; BIBL. 10 REF.Article

COORDINATING AGGREGATE AND DETAILED SCHEDULING IN THE ONE-MACHINE JOB-SHOP. II. COMPUTATION AND STRUCTURE.GELDERS L; KELINDORFER PR.1975; OPER. RES.; U.S.A.; DA. 1975; VOL. 23; NO 2; PP. 312-324; BIBL. 5 REF.Article

SEQUENCING OF RELIABILITY TESTS.LOMNICKI ZA.1975; INTERNATION. J. PRODUCT. RES.; G.B.; DA. 1975; VOL. 13; NO 1; PP. 95-98; ABS. FR. ALLEM.; BIBL. 4 REF.Article

THE APPLICATION OF AUTOMATIC INTERACTION DETECTION (AID) IN OPERATIONAL RESEARCH.ABID ALI M; HICKMAN PJ; CLEMENTSON AT et al.1975; OPER. RES. QUART.; G.B.; DA. 1975; VOL. 26; NO 2; PP. 243-252; BIBL. 4 REF.Article

SUR L'EFFICACITE DE LA METHODE ARBORESCENTE (BRANCH AND BOUND)VENGEROVA IV; FINKEL'SHTEJN YU YU.1975; EKON. MAT. METODY; S.S.S.R.; DA. 1975; VOL. 11; NO 1; PP. 186-193; BIBL. 11 REF.Article

ON INTEGER SOLUTIONS TO QUADRATIC PROGRAMS BY BRANCH AND BOUND TECHNIQUE.AGRAWAL SC.1974; TRAB. ESTADIST. INVEST. OPER.; ESP.; DA. 1974; VOL. 25; NO 1-2; PP. 65-70; BIBL. 7 REF.Article

SCHEDULING JOBS ON A NUMBER OF IDENTICAL MACHINES.ELMAGHRABY SE; PARK SH.1974; A.I.I.E. TRANS.; U.S.A.; DA. 1974; VOL. 6; NO 1; PP. 1-13; BIBL. 17 REF.Article

CHOIX DE L'ITINERAIRE OPTIMAL DES TRANSPORTS D'URGENCEPROKOF'EV ON.1974; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; S.S.S.R.; DA. 1974; NO 2; PP. 23-30; BIBL. 2 REF.Article

SOLUTION DU PROBLEME DE LA COUPE MINIMALE DANS UN GRAPHE ORIENTE BI-CONNECTE PAR LES ALGORITHMES DU TYPE ARBORESCENTBURKOV VN; GROPPEN VO.1974; AVTOMAT. I TELEMEKH.; S.S.S.R.; DA. 1974; NO 9; PP. 104-110; ABS. ANGL.; BIBL. 6 REF.Article

SUR LA SOLUTION DU PROBLEME DES COUTS FIXESWDOWIAK J.1973; PRZEGL. STATYST.; POLSKA; DA. 1973; VOL. 20; NO 2; PP. 231-252; ABS. RUSSE ANGL.; BIBL. 10 REF.Article

ON RESOURCE ALLOCATION IN PROJECT NETWORKS = L'ALLOCATION DES RESSOURCES DANS DES RESEAUX DE PROJETHASTINGS NAJ.1972; OPER. RES. QUART.; G.B.; DA. 1972; VOL. 23; NO 2; PP. 217-221; BIBL. 5 REF.Serial Issue

OPTIMUM PRODUCTION SCHEDULING OF MULTICOMMODITY IN FLOW LINEMITSUMORI S.1972; I.E.E.E. TRANS. SYST. MAN CYBERN; U.S.A.; DA. 1972; VOL. 2; NO 4; PP. 486-493; BIBL. 9 REF.Serial Issue

SOLVING RESOURCE-CONSTRAINED NETWORK PROBLEMS BY IMPLICIT ENUMERATION. PREEMPTIVE CASESCHRAGE L.1972; OPER. RES.; U.S.A.; DA. 1972; VOL. 20; NO 3; PP. 668-677; BIBL. 9 REF.Serial Issue

EIN REIHENFOLGEPROBLEM IN DER NETZPLANTECHNIKSCHALLEHN W; SEBASTIAN HJ.1972; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1972; VOL. 8; NO 1; PP. 3-30; ABS. ANGL. RUSSE; BIBL. 6 REF.Serial Issue

PARTITION OPTIMALE DES SOMMETS D'UN GRAPHEBECK M.1972; ; S.L.; DA. 1972; PP. 1-168; BIBL. 5 P.; (THESE DOCT. 3EME CYCLE, SPEC. STAT. MATH., MENTION MATH. STAT.; UNIV. PARIS VI; 1972)Thesis

LA METHODE BRANCH AND BOUND CONSIDEREE COMME UNE METHODE REGULIERE POUR LA SOLUTION DES PROBLEMES IRREGULIERS DE PROGRAMMATION MATHEMATIQUE. I.BURKOV VN; LAZEBNIK AI; KHRANOVICH IL et al.1972; AVTOMAT. I TELEMEKH.; S.S.S.R.; DA. 1972; NO 7; PP. 169-177; ABS. ANGL.; BIBL. 6 REF.Serial Issue

PROJECT SCHEDULING WITH RESOURCE CONSTRAINTS USING BRANCH AND BOUND METHODS.WILLIS RJ; HASTING NAJ.1976; OPER. RES. QUART.; G.B.; DA. 1976; VOL. 27; NO 2I; PP. 341-349; BIBL. 10 REF.Article